The Computational Complexity of Knot Genus and Spanning Area
نویسندگان
چکیده
We show that 3-MANIFOLD KNOT GENUS, the problem of deciding whether a polygonal knot in a closed three-dimensional manifold bounds a surface of genus at most g, is NP-complete. We also show that the problem of deciding whether a curve in a PL manifold bounds a surface of area less than a given constant C is NP-hard.
منابع مشابه
3-MANIFOLD KNOT GENUS is NP-complete
One of the central questions in topology is determining whether a given curve is knotted or unknotted. An algorithm to decide this question was given by Haken in 1961, using the technique of normal surfaces. These surfaces are rigid, discretized surfaces, well suited for algorithmic analysis. Any oriented surface without boundary can be obtained from a sphere by adding “handles”. The number of ...
متن کاملPachner moves, generic complexity, and randomising 3-manifold triangulations
We study the computational complexity of decision problems on triangulated 3-manifolds. In this setting there has been encouraging initial progress in recent years, but many important questions remain wide open. The “simple” problem of 3-sphere recognition and the related problem of unknot recognition are both known to be in NP, by work of Schleimer [18] and earlier work of Hass, Lagarias and P...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملRulings of Legendrian knots as spanning surfaces
Each ruling of a Legendrian link can be naturally treated as a surface. For knots, the ruling is 2–graded if and only if the surface is orientable. For 2–graded rulings of homogeneous (in particular, alternating) knots, we prove that the genus of this surface is at most the genus of the knot. While this is not true in general, we do prove that the canonical genus (a.k.a. diagram genus) of any k...
متن کاملNURBS-Based Isogeometric Analysis Method Application to Mixed-Mode Computational Fracture Mechanics
An interaction integral method for evaluating mixed-mode stress intensity factors (SIFs) for two dimensional crack problems using NURBS-based isogeometric analysis method is investigated. The interaction integral method is based on the path independent J-integral. By introducing a known auxiliary field solution, the mixed-mode SIFs are calculated simultaneously. Among features of B-spline basis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002